Multisource Algorithmic Information Theory
نویسنده
چکیده
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framework for many interesting questions about Kolmogorov complexity.
منابع مشابه
Multisource information theory
Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framework for many interesting questions about Kolmogorov complexity.
متن کاملProbabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملFour Skeletons and a Function
Four algorithmic skeletons for low-level image processing and intermediate-level computer vision are presented, related to a common divide and conquer higher order function. The parallel operation of each skeleton is described and their use in a complete parallel multisource image segmentation system is discussed.
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملMultisource classification using ICM and Dempster-Shafer theory
We propose to use evidential reasoning in order to relax Bayesian decisions given by a Markovian classification algorithm (ICM). The Dempster–Shafer rule of combination enables us to fuse decisions in a local spatial neighborhood which we further extend to be multisource. This approach enables us to more directly fuse information. Application to the classification of very noisy images produces ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره شماره
صفحات -
تاریخ انتشار 2006